Profinite Monads, Profinite Equations, and Reiterman's Theorem
نویسندگان
چکیده
Profinite equations are an indispensable tool for the algebraic classification of formal languages. Reiterman’s theorem states that they precisely specify pseudovarieties, i.e. classes of finite algebras closed under finite products, subalgebras and quotients. In this paper Reiterman’s theorem is generalised to finite Eilenberg-Moore algebras for a monad T on a variety D of (ordered) algebras: a class of finite T-algebras is a pseudovariety iff it is presentable by profinite (in-)equations. As an application, quasivarieties of finite algebras are shown to be presentable by profinite implications. Other examples include finite ordered algebras, finite categories, finite ∞-monoids, etc.
منابع مشابه
Equational theories of profinite structures
In this paper we consider a general way of constructing profinite structures based on a given framework — a countable family of objects and a countable family of recognisers (e.g. formulas). The main theorem states: A subset of a family of recognisable sets is a lattice if and only if it is definable by a family of profinite equations. This result extends Theorem 5.2 from [GGEP08] expressed onl...
متن کاملModular Representations of Profinite Groups
Our aim is to transfer several foundational results from the modular representation theory of finite groups to the wider context of profinite groups. We are thus interested in profinite modules over the completed group algebra k[[G]] of a profinite group G, where k is a finite field of characteristic p. We define the concept of relative projectivity for a profinite k[[G]]-module. We prove a cha...
متن کاملFrom Ultrafilters on Words to the Expressive Power of a Fragment of Logic
We give a method for specifying ultrafilter equations and identify their projections on the set of profinite words. Let B be the set of languages captured by first-order sentences using unary predicates for each letter, arbitrary uniform unary numerical predicates and a predicate for the length of a word. We illustrate our methods by giving profinite equations characterizing B ∩Reg via ultrafil...
متن کاملCohomology of Profinite Groups
The aim of this thesis is to study profinite groups of type FPn. These are groups G which admit a projective resolution P of Ẑ as a ẐJGK-module such that P0, . . . , Pn are finitely generated, so this property can be studied using the tools of profinite group cohomology. In studying profinite groups it is often useful to consider their cohomology groups with profinite coefficients, but pre-exis...
متن کاملThe Geometry of Profinite Graphs with Applications to Free Groups and Finite Monoids
We initiate the study of the class of profinite graphs Γ defined by the following geometric property: for any two vertices v and w of Γ, there is a (unique) smallest connected profinite subgraph of Γ containing them; such graphs are called tree-like. Profinite trees in the sense of Gildenhuys and Ribes are tree-like, but the converse is not true. A profinite group is then said to be dendral if ...
متن کامل